Generous and Greedy Strategies Bengt Carlsson

Generous and Greedy Strategies

We introduce generous, even-matched, and greedy strategies as concepts for analyzing games. A two person prisoner's dilemma game is described by the four outcomes (C,D), (C,C), (D,C), and (D,D). In a generous strategy the proportion of (C,D) is larger than that of (D,C), i.e. the probability of facing a defecting agent is larger than the probability of defecting. An even-matched strategy has th...

Modeling Strategies as Generous and Greedy in Prisoner's Dilemma like Games

strategies to become more successful. In compromise dilemma (C,D) and (D,C) have the best scores making a balance between diierent strategies possible. Like ESS this description of MAS, as a competition between generous and greedy strategies, tries to nd robust strategies that are able to resist invasion by other strategies. It is not possible to nd a single best strategy that wins, but it is p...

The Success of Cooperative Strategies in the Iterated Prisoner's Dilemma and the Chicken Game

Räkneövningar Empirisk modellering

Räkneuppgifter samt lite kompletterande teori.

Game Theory and Agents

A fundamental problem in multi agent systems is conflict resolution. A conflict occurs in general when the agents have to deal with conflicting goals, such as demands for shared, but limited resources. We investigate how game theory may be a helpful and efficient tool for examining a class of conflicts in multi agent systems and argue that parameterized games and conclusions based on general pr...